Deciding game invariance

Deciding game invariance

In [12], Duchêne and Rigo introduced the notion of invariance for take-away games on heaps. Roughly speaking, these are games whose rulesets do not depend on the position. Given a sequence S of positive tuples of integers, the question of whether there exists an invariant game having S as set of P-positions is relevant. In particular, it was recently proved by Larsson et al. [23] that if S is a...

A Game-Theoretic Approach to Deciding Higher-Order Matching

Deciding to defect: the effects of video-game violence on cooperative behavior.

This experiment examined the effect of video-game violence on cooperative decision making. Participants (N= 48) were randomly assigned to play either a violent or a nonviolent version of the video game Doom in dyads. Following the video-game task, participants were separated and given an opportunity to choose to cooperate with their partner for mutual gain, withdraw from the interaction, or exp...

Deciding the Winner of an Arbitrary Finite Poset Game Is PSPACE-Complete

A poset game is a two-player game played over a partially ordered set (poset) in which the players alternate choosing an element of the poset, removing it and all elements greater than it. The first player unable to select an element of the poset loses. Polynomial time algorithms exist for certain restricted classes of poset games, such as the game of Nim. However, until recently the complexity...

Deciding absorption

We characterize absorption in finite idempotent algebras by means of Jónsson absorption and cube term blockers. As an application we show that it is decidable whether a given subset is an absorbing subuniverse of an algebra given by the tables of its basic operations.